On the Eigenspaces of Lamplighter Random Walks and Percolation Clusters on Graphs
نویسنده
چکیده
We show that the Plancherel measure of the lamplighter random walk on a graph coincides with the expected spectral measure of the absorbing random walk on the Bernoulli percolation clusters. In the subcritical regime the spectrum is pure point and we construct a complete set of finitely supported eigenfunctions.
منابع مشابه
Anchored expansion, percolation and speed
Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56–84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve several problems raised by those authors. The anchored expansion constant is a variant of the Cheeger constant; its positivity implies positive lower speed for the...
متن کاملOn the Spectrum of Lamplighter Groups and Percolation Clusters
Let G be a finitely generated group and X its Cayley graph with respect to a finite, symmetric generating set S. Furthermore, let H be a finite group and H ≀G the lamplighter group (wreath product) over G with group of “lamps” H. We show that the spectral measure (Plancherel measure) of any symmetric “switch–walk–switch” random walk on H ≀G coincides with the expected spectral measure (integrat...
متن کاملHarmonic analysis of finite lamplighter random walks
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path Z. In the present paper, we develop a spectral analysis for lamplighter random walks on finite graphs. In the general case, we use the C2-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. In th...
متن کاملThe Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview
Benjamini, Lyons and Schramm (1999) considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. To address problems raised by those authors, we study simple random walk on the infinite percolation cluster in Cayley graphs of certain amenable groups known as “lamplighter groups”. We prove that zero speed for random walk on a lamplig...
متن کاملPositive Harmonic Functions for Semi-isotropic Random Walks on Trees, Lamplighter Groups, and Dl-graphs
We determine all positive harmonic functions for a large class of “semiisotropic” random walks on the lamplighter group, i.e., the wreath product Zq ≀Z, where q ≥ 2. This is possible via the geometric realization of a Cayley graph of that group as the Diestel-Leader graph DL(q, q). More generally, DL(q, r) (q, r ≥ 2) is the horocyclic product of two homogeneous trees with respective degrees q+1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008